Independence of Causal Influence and Clique Tree Propagation
نویسندگان
چکیده
This paper explores the role of independence of causal influence (ICI) in Bayesian network inference. ICI allows one to factorize a con ditional probability table into smaller pieces. We describe a method for exploiting the fac torization in clique tree propagation (CTP) the state-of-the-art exact inference algo rithm for Bayesian networks. We also present empirical results showing that the resulting algorithm is significantly more efficient than the combination of CTP and previous tech niques for exploiting ICI.
منابع مشابه
Independence of Causal In uence and Clique Tree Propagation
This paper explores the role of independence of causal in uence (ICI) in Bayesian network inference. ICI allows one to factorize a conditional probability table into smaller pieces. We describe a method for exploiting the factorization in clique tree propagation (CTP) | the state-of-the-art exact inference algorithm for Bayesian networks. We also present empirical results showing that the resul...
متن کاملA Factorized Representation of Independence of Causal Influence and Lazy Propagation
The efficiency of algorithms for probabilistic inference in Bayesian networks can be improved by exploiting independence of causal influence. The factorized representation of independence of causal influence offers a factorized decomposition of certain independence of causal influence models. We describe how lazy propagation a junction tree based inference algorithm easily can be extended to ta...
متن کاملLAZY Propagation: A Junction Tree Inference Algorithm Based on Lazy Evaluation
In this paper we present a junction tree based inference architecture exploiting the structure of the original Bayesian network and independence relations induced by evidence to improve the efficiency of inference. The efficiency improvements are obtained by maintaining a multiplicative decomposition of clique and separator potentials. Maintaining a multiplicative decomposition of clique and se...
متن کاملA Factorized Representation of Independence of Causal In uence and Lazy Propagation
The eeciency of algorithms for probabilistic inference in Bayesian networks can be improved by exploiting independence of causal innuence. The factorized representation of independence of causal innuence ooers a factorized decomposition of certain independence of causal innuence models. We describe how lazy propagation a junction tree based inference algorithm-easily can be extended to take adv...
متن کاملNested Junction Trees
The efficiency of inference in both the Hugin and, most notably, the Shafer-Shenoy archi tectures can be improved by exploiting the independence relations induced by the incom ing messages of a clique. That is, the mes sage to be sent from a clique can be com puted via a factorization of the clique poten tial in the form of a junction tree. In this pa per we show that by exploiting such n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997